Piotr Indyk - PDFSEARCH.IO - Document Search Engine

Piotr Indyk
Results: 118

#	Item
71	Beyond Locality-Sensitive Hashing Alexandr Andoni Microsoft Research Piotr Indyk MIT Add to Reading List Source URL: www.mit.edu Language: English - Date: 2013-11-12 13:38:57
72	External Sampling∗ Alexandr Andoni MIT Piotr Indyk Add to Reading List Source URL: www.mit.edu Language: English - Date: 2009-09-29 22:20:14
73	Stable Distributions, Pseudorandom Generators, Embeddings, and Data Stream Computation PIOTR INDYK MIT, Cambridge, Massachusetts Abstract. In this article, we show several results obtained by combining the use of stable Add to Reading List Source URL: www.cs.dartmouth.edu Language: English - Date: 2011-10-13 09:44:37
74	E2LSH 0.1 User Manual Alexandr Andoni Piotr Indyk June 21, 2005 Add to Reading List Source URL: web.mit.edu Language: English - Date: 2005-06-21 14:20:19
75	On Streaming and Communication Complexity of the Set Cover Problem Erik D. Demaine, Piotr Indyk, Sepideh Mahabadi, and Ali Vakilian Massachusetts Instittute of Technology (MIT) {edemaine,indyk,mahabadi,vakilian}@mit.edu Add to Reading List Source URL: www.mit.edu Language: English - Date: 2014-08-06 12:02:47
76	Lower Bounds for Sparse Recovery∗ Khanh Do Ba MIT CSAIL Piotr Indyk MIT CSAIL Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2009-10-13 01:19:05
77	Compressive sensing using locality-preserving matrices Elyot Grant∗ Piotr Indyk∗ December 4, 2012 Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2013-06-10 19:22:49 Error detection and correction Information retrieval Artificial intelligence Computational complexity theory Universal hashing Lipschitz continuity Hash function Combinatory logic Tabulation hashing Search algorithms Hashing Theoretical computer science
78	Near-Optimal Sparse Recovery in the L1 norm Piotr Indyk MIT Milan Ruˇzi´c Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2009-07-09 16:30:50 Field theory Valuation Algebra Differential topology Abstract algebra Differential geometry Algebraic geometry
79	Nearly Linear-Time Model-Based Compressive Sensing Chinmay Hegde, Piotr Indyk, and Ludwig Schmidt Massachusetts Institute of Technology, Cambridge MA 02139, USA Abstract. Compressive sensing is a method for recording a Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2015-05-25 21:19:32 Analysis of algorithms Linear algebra Computational complexity theory Numerical linear algebra Sparse approximation Time complexity Compressed sensing Big O notation Tree decomposition Theoretical computer science Mathematics Applied mathematics
80	(Nearly) Sample-Optimal Sparse Fourier Transform Piotr Indyk MIT Michael Kapralov MIT∗ Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2014-12-09 10:13:50 Fourier analysis Unitary operators Digital signal processing Computational complexity theory Analysis of algorithms Fourier transform Time complexity Computational complexity of mathematical operations Euclidean algorithm Mathematical analysis Theoretical computer science Mathematics

UPDATE